Bayesian Ptolemaic Psychology

نویسندگان

  • Clark Glymour
  • Choh Man Teng
  • David Danks
چکیده

Ptolemy’s device, the epicycle on deferent, allowed him to account very accurately for motions with respect to the fixed stars of the sun, the moon, and the five observable planets. Indeed, thanks to Harold Bohr, we now know, as Ptolemy did not, that any periodic motions can be approximated arbitrarily well by iterations of epicycles. So far as the data concern only semi-periodic motions with respect to the fixed stars, Ptolemy’s framework can fit anything. Copernicus’ framework is not so generous; it requires strict relations among the observable motions of the sun and the planets, and Kepler saw in those relations the very explanatory virtues of Copernican theory, and the comparative explanatory defects of Ptolemaic theory. In Kepler’s hand, the Copernican identification of observable features of solar/planetary motion—angles of separation, oppositions,

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the Laminar Structure of Ptolemaic and Distance Hereditary Graphs

Ptolemaic graphs are graphs that satisfy ptolemaic inequality for any four vertices. The graph class coincides with the intersection of chordal graphs and distance hereditary graphs. The graph class can also be seen as a natural generalization of block graphs (and hence trees). In this paper, a new characterization of ptolemaic graphs is presented. It is a canonical tree representation based on...

متن کامل

Laminar Structure of Ptolemaic Graphs and Its Applications

Ptolemaic graphs are graphs that satisfy the Ptolemaic inequality for any four vertices. The graph class coincides with the intersection of chordal graphs and distance hereditary graphs, and it is a natural generalization of block graphs (and hence trees). In this paper, a new characterization of ptolemaic graphs is presented. It is a laminar structure of cliques, and leads us to a canonical tr...

متن کامل

New results on ptolemaic graphs

In this paper, we analyze ptolemaic graphs for its properties as chordal graphs. Firstly, two characterizations of ptolemaic graphs are proved. The first one is based on the reduced clique graph, a structure that was defined by Habib and Stacho [8]. In the second one, we simplify the characterization presented by Uehara and Uno [13] with a new proof. Then, known subclasses of ptolemaic graphs a...

متن کامل

Probe Ptolemaic Graphs

Given a class of graphs, G, a graph G is a probe graph of G if its vertices can be partitioned into two sets, P (the probes) and N (the nonprobes), where N is an independent set, such that G can be embedded into a graph of G by adding edges between certain nonprobes. In this paper we study the probe graphs of ptolemaic graphs when the partition of vertices is unknown. We present some characteri...

متن کامل

Longest Path Problems on Ptolemaic Graphs

SUMMARY Longest path problem is a problem for finding a longest path in a given graph. While the graph classes in which the Hamiltonian path problem can be solved efficiently are widely investigated, there are few known graph classes such that the longest path problem can be solved efficiently. Polynomial time algorithms for finding a longest cycle and a longest path in a Ptolemaic graph are pr...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2015